Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer. Automation --- #TCPW P3.0 --- 681.3*F13 --- 681.3*F2 --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Logique

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Numerical analysis --- Computer science --- 510.5 --- Algorithms. Computable functions --- #TCPW P3.0 --- 681.3*F2 --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Turing machines. --- Recursive functions. --- Algorithms. --- Formal languages. --- 510.5 Algorithms. Computable functions --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13}

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Numerical analysis --- Computer science --- Computer algorithms --- Algorithmes --- Computer algorithms. --- 519.682 --- 681.3*F2 --- Algorithms --- Programming languages. Metalanguages --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 519.682 Programming languages. Metalanguages --- Algorithmes (Ordinateur) --- Algoritmen (Computer)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer algorithms --- Functional programming languages --- 681.3*D11 --- 681.3*F2 --- Programming languages (Electronic computers) --- Algorithms --- Applicative (functional) programming --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*D11 Applicative (functional) programming

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Matching problems with preferences are all around us - they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists.In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide. This book describes the most important results in this area, providing a timely upda

Computer algorithms. --- Algorithms --- Matching theory --- 681.3*F2 --- Combinatorial analysis --- Marriage theorem --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Matching theory. --- Marriage theorem. --- Computer science --- Mathematics.